Below All Subsets for Some Permutational Counting Problems
نویسنده
چکیده
We show that the two problems of computing the permanent of an n × n matrix of poly(n)-bit integers and counting the number of Hamiltonian cycles in a directed n-vertex multigraph with exp(poly(n)) edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in o(2) time in the worst case. Classic poly(n)2 time algorithms for the two problems have been known since the early 1960’s. Our algorithms run in 2n−Ω( √ n/ logn) time. 1998 ACM Subject Classification G.2.2 Graph Theory
منابع مشابه
Some Computational Problems Related to Pseudo-intents
We investigate the computational complexity of several decision, enumeration and counting problems related to pseudo-intents. We show that given a formal context and a set of its pseudo-intents, checking whether this context has an additional pseudo-intent is in conp and it is at least as hard as checking whether a given simple hypergraph is saturated. We also show that recognizing the set of p...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملOn the Essential Spectrum of Many-Particle Pseudorelativistic Hamiltonians with Permutational Symmetry Account
In this paper we formulate our results on the essential spectrum of many-particle pseudorelativistic Hamiltonians without magnetic and external potential fields in the spaces of functions, having arbitrary type α of the permutational symmetry. We discover location of the essential spectrum for all α and for some cases we establish new properties of the lower bound of this spectrum, which are us...
متن کاملCounting the Number of Unavoidable Sets of a given Size in a Finite Set of Integers
In this paper, we introduce the U -function on N, the set of natural numbers. U(k, n), for positive integers k, n with k ≤ n and n ≥ 3, counts the number of unavoidable sets of size k which are subsets of {1, 2, ..., n}, where the notion of avoidability is defined below. We use some straightforward observations as well as the results of Shan, Zhu, Dumitriu, and Develin to observe that U(1, n) =...
متن کاملEnumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for different examples involving classical self-similar graphs such as the Sierpiński graphs. The enumeration problems we investiga...
متن کامل